The Mode of Merging Sort for Enterprises 'Knowledge Source Based on Archives Management 基于档案管理的企业知识源梳理模式
The New Merging Sort Algorithm by Mapping 任意分布数据的映射归并排序算法研究
The Non-recursion Algorithmic of Merging Sort 归并排序法的非递归实现
Then the efficiency of the insertion sort and merging sort algorithms are analyzed by means of entropy, and it is pointed out that when the length of the series is larger than 4, any sorting algorithm based on direct comparison requires more comparisons than the lower bound. 然后利用信息熵原理分析了插入排序和归并排序的效率,指出当序列长度大于4时,任何直接插入排序的比较次数大于理论下界。
In addition this method establishes huge inverted table by merging for only twice, and realizes relevance sort by analyzing the features of kev word. 该方法仅通过两次迭代归并,即能建立海量倒排表,通过分析关键字段特征实现相关性排序。
This article has provided a kind of improved algorithm for merging sort, which has remarkable advantage in sorting a large amount of discrete data. 给出了归并排序算法的一种改进算法,对具有离散性的多个数据排序时利用该算法具有较明显的优势。
The method is obviously better than those of Flash Sort 、 Proportion Split Sort 、 2 Course Merging Sort and Straight K Course Merging Sort in dealing with the sorting problem of large scale gathering. 而且在处理上述大规模汇总排序问题时,映射归并排序速度明显优于FlashSort、ProportionSplitSort、2路重复的K路归并排序和直接K路归并排序等算法。